Projection Inequalities and Their Linear Preservers
Authors
Abstract:
This paper introduces an inequality on vectors in $mathbb{R}^n$ which compares vectors in $mathbb{R}^n$ based on the $p$-norm of their projections on $mathbb{R}^k$ ($kleq n$). For $p>0$, we say $x$ is $d$-projectionally less than or equal to $y$ with respect to $p$-norm if $sum_{i=1}^kvert x_ivert^p$ is less than or equal to $ sum_{i=1}^kvert y_ivert^p$, for every $dleq kleq n$. For a relation $sim$ on a set $X$, we say a map $f:X rightarrow X$ is a preserver of that relation, if $xsim y$ implies $f(x)sim f(y)$, for every $x,yin X$. All the linear maps that preserve $d$-projectional equality and inequality are characterized in this paper.
similar resources
Linear Preservers of Majorization
For vectors $X, Yin mathbb{R}^{n}$, we say $X$ is left matrix majorized by $Y$ and write $X prec_{ell} Y$ if for some row stochastic matrix $R, ~X=RY.$ Also, we write $Xsim_{ell}Y,$ when $Xprec_{ell}Yprec_{ell}X.$ A linear operator $Tcolon mathbb{R}^{p}to mathbb{R}^{n}$ is said to be a linear preserver of a given relation $prec$ if $Xprec Y$ on $mathbb{R}^{p}$ implies that $TXprec TY$ on $mathb...
full textLinear Size Distance Preservers
The famous shortest path tree lemma states that, for any node s in a graph G = (V,E), there is a subgraph on O(n) edges that preserves all distances between node pairs in the set {s}×V . A very basic question in distance sketching research, with applications to other problems in the field, is to categorize when else graphs admit sparse subgraphs that preserve distances between a set P of p node...
full textLatin-majorization and its linear preservers
In this paper we study the concept of Latin-majorizati-\on. Geometrically this concept is different from other kinds of majorization in some aspects. Since the set of all $x$s Latin-majorized by a fixed $y$ is not convex, but, consists of union of finitely many convex sets. Next, we hint to linear preservers of Latin-majorization on $ mathbb{R}^{n}$ and ${M_{n,m}}$.
full textVolume difference inequalities for the projection and intersection bodies
In this paper, we introduce a new concept of volumes difference function of the projection and intersection bodies. Following this, we establish the Minkowski and Brunn-Minkowski inequalities for volumes difference function of the projection and intersection bodies.
full textTotally Positive Density Matrices and Linear Preservers
The intersection between the set of totally nonnegative matrices, which are of interest in many areas of matrix theory and its applications, and the set of density matrices, which provide the mathematical description of quantum states, are investigated. The single qubit case is characterized, and several equivalent conditions for a quantum channel to preserve the set in that case are given. Hig...
full textGeneralized Doubly Stochastic Matrices and Linear Preservers
A real or complex n × n matrix is generalized doubly stochastic if all of its row sums and column sums equal one. Denote by V the linear space spanned by such matrices. We study the reducibility of V under the group Γ of linear operators of the form A 7→ PAQ, where P and Q are n×n permutation matrices. Using this result, we show that every linear operator φ : V → V mapping the set of generalize...
full textMy Resources
Journal title
volume 4 issue 2
pages 61- 67
publication date 2017-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023